A simple proof of the Erdos-Gallai theorem on graph sequences
نویسندگان
چکیده
منابع مشابه
Hypergraph Extensions of the Erdos-Gallai Theorem
Our goal is to extend the following result of Erd˝ os and Gallai for hypergraphs: Theorem 1 (Erd˝ os-Gallai [1]) Let G be a graph on n vertices containing no path of length k. Then e(G) ≤ 1 2 (k − 1)n. Equality holds iff G is the disjoint union of complete graphs on k vertices. We consider several generalizations of this theorem for hypergraphs. This is due to the fact that there are several po...
متن کاملA new proof of the Sylvester-Gallai theorem
In 1893 J. J. Sylvester [8] posed the following celebrated problem: Given a finite collection of points in the affine plane, not all lying on a line, show that there exists a line which passes through precisely two of the points. Sylvester’s problem was reposed by Erdős in 1944 [4] and later that year a proof was given by Gallai [6]. Since then, many proofs of the Sylvester-Gallai Theorem have ...
متن کاملGeneralization of the Erdos-Gallai Inequality
P. Erdős and T. Gallai gave necessary and sufficient conditions for a sequence of non-negative integers to be graphic. Here,their result is generalized to multigraphs with a specified multiplicity. This both generalizes and provides a new proof of a result in the literature by Chungphaisan [2].
متن کاملA short constructive proof of the Erdos-Gallai characterization of graphic lists
Erdős and Gallai proved that a nonincreasing list (d1, . . . , dn) of nonnegative integers is the list of degrees of a graph (with no loops or multi-edges) if and only if the sum is even and the list satisfies ∑k i=1 di ≤ k(k−1)+ ∑n i=k+1 min{k, di} for 1 ≤ k ≤ n. We give a short constructive proof of the characterization. AMS Subject classification: 05C07
متن کاملOn the Erdos-stone Theorem
for all n large enough with respect to c and d. In a sense, this result is best possible: as shown by Bollobas and Erdos [1], our constant 1/500 cannot be increased beyond 5. Our argument hinges on a theorem asserting that every sufficiently large graph can be partitioned into a small number of classes in such a way that the partition exhibits strong regularity properties. To state the theorem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1986
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700002872